Fast and Accurate Computation of Gauss-Legendre and Gauss-Jacobi Quadrature Nodes and Weights

نویسندگان

  • Nicholas Hale
  • Alex Townsend
چکیده

An efficient algorithm for the accurate computation of Gauss–Legendre and Gauss– Jacobi quadrature nodes and weights is presented. The algorithm is based on Newton’s root-finding method with initial guesses and function evaluations computed via asymptotic formulae. The n-point quadrature rule is computed in O(n) operations to an accuracy of essentially double precision for any n ≥ 100.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Iteration-Free Computation of Gauss-Legendre Quadrature Nodes and Weights

Gauss–Legendre quadrature rules are of considerable theoretical and practical interest because of their role in numerical integration and interpolation. In this paper, a series expansion for the zeros of the Legendre polynomials is constructed. In addition, a series expansion useful for the computation of the Gauss–Legendre weights is derived. Together, these two expansions provide a practical ...

متن کامل

Interpolation approximations based on Gauss-Lobatto-Legendre-Birkhoff quadrature

We derive in this paper the asymptotic estimates of the nodes and weights of the Gauss-Lobatto-Legendre-Birkhoff (GLLB) quadrature formula, and obtain optimal error estimates for the associated GLLB interpolation in Jacobi weighted Sobolev spaces. We also present a useroriented implementation of the pseudospectral methods based on the GLLB quadrature nodes for Neumann problems. This approach al...

متن کامل

Fast and rigorous arbitrary-precision computation of Gauss-Legendre quadrature nodes and weights

We describe a strategy for rigorous arbitrary-precision evaluation of Legendre polynomials on the unit interval and its application in the generation of Gauss-Legendre quadrature rules. Our focus is on making the evaluation practical for a wide range of realistic parameters, corresponding to the requirements of numerical integration to an accuracy of about 100 to 100 000 bits. Our algorithm com...

متن کامل

Potential evaluation in space-time BIE formulations of 2D wave equation problems

In this paper we examine the computation of the potential generated by space-time BIE representations associated with Dirichlet and Neumann problems for the 2D wave equation. In particular, we consider the efficient evaluation of the (convolution) time integral that appears in the potential representation. For this, we propose two simple quadrature rules which appear more efficient than the cur...

متن کامل

Computation of Gauss-kronrod Quadrature Rules with Non-positive Weights

Recently Laurie presented a fast algorithm for the computation of (2n + 1)-point Gauss-Kronrod quadrature rules with real nodes and positive weights. We describe modifications of this algorithm that allow the computation of Gauss-Kronrod quadrature rules with complex conjugate nodes and weights or with real nodes and positive and negative weights.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • SIAM J. Scientific Computing

دوره 35  شماره 

صفحات  -

تاریخ انتشار 2013